#include<bits/stdc++.h>
using namespace std;
inline int read(){
	int x=0;bool f=0;char ch=getchar();
	while(ch<'0'||ch>'9')f^=(ch=='-'),ch=getchar();
	while('0'<=ch&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return f?-x:x;
}
struct node{
	int id,val;
	inline bool operator<(const node&a)const{return a.val<val;}
};
priority_queue<node>heap;
int main(){
	heap.push({1,1});heap.push({2,2});
	printf("%d\n",heap.top().id);
	return 0;
}

